Computing minimum length representations of sets of words of uniform length
نویسندگان
چکیده
منابع مشابه
Computing Minimum Length Representations of Sets of Words of Uniform Length
Motivated by text compression, the problem of representing sets of words of uniform length by partial words, i.e., sequences that may have some wildcard characters or holes, was recently considered and shown to be in P. Polynomial-time algorithms that construct representations were described using graph theoretical approaches. As more holes are allowed, representations shrink, and if representa...
متن کاملUnavoidable Sets of Partial Words of Uniform Length
A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X . Unlike the case of a set of words without holes, the problem of deciding whether or not a given finite set of n partial words over a k-letter alphabet is avoidable is NP-hard, even when we restrict to a set of partial words of uniform len...
متن کاملcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولDeciding Representability of Sets of Words of Equal Length
Partial words are sequences over a finite alphabet that may have holes that match, or are compatible with, all letters in the alphabet; partial words without holes are simply words. Given a partial word w, we denote by subw(n) the set of subwords of w of length n, i.e., words over the alphabet that are compatible with factors of w of length n. We call a set S of words h-representable if S = sub...
متن کاملCounting Words of Minimum Length in an Automorphic Orbit
Abstract. Let u be a cyclic word in a free group Fn of finite rank n that has the minimum length over all cyclic words in its automorphic orbit, and let N(u) be the cardinality of the set {v : |v| = |u| and v = φ(u) for some φ ∈ AutFn}. In this paper, we prove that N(u) is bounded by a polynomial function with respect to |u| under the hypothesis that if two letters x, y with x 6= y occur in u, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.06.038